Exact Fluid Lumpability for Chemical Reaction Networks

نویسندگان

  • Luca Cardelli
  • Mirco Tribastone
  • Max Tschaikowski
چکیده

We present a technique for the automatic reduction of chemical reaction networks (CRNs). We study exact fluid lumpability, a partition of species satisfying the dynamical property that species in the same block have the same output at all times if initialized equally. Inspired by analogous approaches in traditional models of computation such as labelled transition systems, we characterize this property as a behavioral equivalence over species which can be checked only using CRN structural information. We give an algorithm to construct a quotient CRN induced by exact fluid lumpability. Further, we provide an algorithm that computes the coarsest partition in polynomial time. As an application, we find significant, lossless reductions in a number of models of biological processes available in the literature. In two cases we allow the analysis of benchmark models which would be otherwise intractable due to their memory requirements.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extended Differential Aggregations in Process Algebra for Performance and Biology

We study aggregations for ordinary differential equations induced by fluid semantics for Markovian process algebra which can capture the dynamics of performance models and chemical reaction networks. Whilst previous work has required perfect symmetry for exact aggregation, we present approximate fluid lumpability, which makes nearby processes perfectly symmetric after a perturbation of their pa...

متن کامل

Exact and Ordinary Lumpability in Finite Markov Chainsy

Exact and ordinary lumpability in nite Markov chains is considered. Both concepts naturally deene an aggregation of the Markov chain yielding an aggregated chain that allows the exact determination of several stationary and transient results for the original chain. We show which quantities can be determined without an error from the aggregated process and describe methods to calculate bounds on...

متن کامل

Towards State Space Reduction Based on T-Lumpability-Consistent Relations

Markovian behavioral equivalences can be exploited for state space reduction before performance evaluation takes place. It is known that Markovian bisimilarity corresponds to ordinary lumpability and that Markovian testing and trace equivalences correspond to a coarser exact relation we call T-lumpability. While there exists an ordinarylumpability-consistent aggregation algorithm, this is not t...

متن کامل

On Relational Properties of Lumpability

The technique of lumping of Markov chains is one of the main tools for recovering from state explosion in the quantitative analysis of large probabilistic systems. Useful results regarding relational properties of general, ordinary and exact lumpability, in particular transitivity and strict confluence, are rather scattered or implicit in the literature. These are collected and reformulated her...

متن کامل

Exact Fluid Lumpability for Markovian Process Algebra

We study behavioural relations for process algebra with a fluid semantics given in terms of a system of ordinary differential equations (ODEs). We introduce label equivalence, a relation which is shown to induce an exactly lumped fluid model, a potentially smaller ODE system which can be exactly related to the original one. We show that, in general, for two processes that are related in the flu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015